Visibility with a moving point of view

Maintaining Visibility of a Polygon with a Moving Point of View

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In linear space, and after O(n log n) preprocessing time, our solution maintains the view at a cost of O(log n) amortized time (resp. O(log n) worst case time) for each change. Our algorithm can also ...

Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes∗

Computing the visible region from a moving point in planar environments has many applications in computer graphics and computational geometry. This problem has been considered thoroughly before and several algorithms have been proposed for it. Almost all these solutions use a preprocessing step to build data structures which reflect the visibility coherence of the scene. Then, this data is used...

Multi-View Visibility Orderings for Real-Time Point-Sampled Rendering

Occlusion-compatible traversals and z-buffering are often regarded as the only choices for resolving visibility in the imageand point-based rendering community. These algorithms do either per-frame or per-pixel computations. This paper first discusses visibility orderings for point samples in general and then discusses orderings that are valid for multiple views. Then we present a novel, highly...

Fuzzy sets form A meta-system-theoretic point of view